Queuing or sharing? A critical evaluation of the single-bottleneck notion.
نویسندگان
چکیده
The model of a single central bottleneck for human information processing is critically examined. Most evidence cited in support of the model has been observed within the overlapping tasks paradigm. It is shown here that most findings obtained within that paradigm and that were used to support the model are also consistent with a simple resource model. The most prominent findings are the millisecond-for-millisecond slope at the left of the RT2-SOA curve, the high RT1-RT2 correlation, the additivity of the effects on RT2 of SOA and of the difficulty of selecting R2, and the washout of the effect of S2 discriminability on RT2 in a dual-task condition. In addition, the asymmetry of the effects of the dual-task requirement on RT1 and RT2 can be accounted for by the resource model provided that it assumes uneven allocation of resources, which is quite reasonable in view of the task asymmetry inherent in the demand characteristics of the paradigm. The same is true for two other findings that appear to support the single-bottleneck model-that in the dual-task condition, the demand of the first task affects equally RT1 and RT2 and that its effect on RT1 is the same as the corresponding effect in the single-task condition. Furthermore, the single-bottleneck model is hard to reconcile with a negative slope at the left of the RT1-SOA curve or a positive slope at the left of the IRI-SOA curve, unless augmented by ancillary assumptions that are yet to be substantiated. Representative data were fit by each of the models using its optimal set of parameters. Both models achieved quite good degrees of fit. It is further argued that since the overlapping tasks paradigm is heavily biased in favor of a speedy reaction to the stimulus that appears first, it is nonoptimal for testing the central bottleneck model. Finally, the bottleneck model is examined in terms of other scientific criteria.
منابع مشابه
Right buffer sizing matters: stability and queuing dynamics in TCP
Motivated by recent concerns that queuing delays in the Internet are on the rise, we conduct a performance evaluation of Compound TCP (C-TCP) in two topologies: a single bottleneck and a multi-bottleneck topology. The first topology consists of a single core router, and the second consists of two distinct sets of TCP flows, regulated by two edge routers, feeding into a common core router. For b...
متن کاملDelay-based congestion control: Flow vs. BitTorrent swarm perspectives
BitTorrent, one of the most widespread file-sharing P2P applications, recently introduced LEDBAT, a novel congestion control protocol aiming at (i) limiting the additional delay due to queuing, to reduce interference with the rest of user traffic (e.g., Web, VoIP and gaming) sharing the same access bottleneck, and (ii) efficiently using the available link capacity, to provide users with good Bi...
متن کاملOptimization Models for a Deteriorating Single Server Queuing Production System
In this paper a single server queuing production system is considered which is subject to gradual deterioration. The system is discussed under two different deteriorating conditions. A planning horizon is considered and server which is a D/M/1 queuing system is gradually deteriorates through time periods. A maintenance policy is taken into account whereby the server is restored to its initial ...
متن کاملInferring Congestion Sharing and Path Characteristics from Packet Interarrival Times
This paper presents new non-intrusive measurement techniques to detect sharing of upstream congestion and discover bottleneck router link speeds. Our techniques are completely passive and require only arrival times of packets and flow identifiers. Our technique for detecting shared congestion is based upon the observation that an aggregated arrival trace from flows that share a bottleneck has v...
متن کاملAnalytic understanding of RED gateways with multiple competing TCP flows
An analytical framework for multiple TCP flows sharing a bottleneck link under the Random Early Detection (RED) regime is developed. Closed form expressions for the steady state throughput and average queueing delay are derived and verified by simulations; these show that RED significantly improves the inherent TCP bias against links with higher round-trip delays as compared to Tail Drop, contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Cognitive psychology
دوره 44 3 شماره
صفحات -
تاریخ انتشار 2002